منابع مشابه
On Panchromatic Digraphs and the Panchromatic Number
Let D = (V,A) be a simple digraph, and let π(D), the panchromatic number of D, be the maximum number of colours k such that for each colouring of its arcs ς : A → [k] a kernel by monochromatic paths N ⊂ V , as introduced in [6], exists. It is not hard to see that D has a kernel —in the sense of Von Neumann [11]— if and only if π(D) = |A|. In this note this invariant is introduced and some of it...
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملA Panchromatic View of Agn
We review the continuum emission of Active Galactic Nuclei (AGN) over the entire electromagnetic spectrum. After a brief historical introduction, we describe the main spectral properties of unobscured AGN, discussing the selection biases which prevent us from having a complete view of the AGN population in the universe, and trying to build an updated spectral energy distribution of optically se...
متن کاملFrom subKautz digraphs to cyclic Kautz digraphs
Kautz digraphs K(d, `) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related with these, the cyclic Kautz digraphs CK(d, `) were recently introduced by Böhmová, Huemer and the author, and some of its distance-related parameters were fixed. In this paper we propose a new approach to cyclic Kautz digraphs by introducing the family ...
متن کاملBlock Line Cut Vertex Digraphs of Digraphs
In this paper, the digraph valued function(digraph operator), namely the block line cut vertex digraph BLC(D) of a digraph D is defined, and the problem of reconstructing a digraph from its block line cut vertex digraph is presented. Outer planarity, maximal outer planarity, and minimally non-outer planarity properties of these digraphs are discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2020
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2019.05.005